Serveur d'exploration sur l'OCR

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

An Efficient Pre-processing Method to Identify Logical Components from PDF Documents

Identifieur interne : 000396 ( Main/Exploration ); précédent : 000395; suivant : 000397

An Efficient Pre-processing Method to Identify Logical Components from PDF Documents

Auteurs : Ying Liu [États-Unis] ; Kun Bai ; Liangcai Gao [République populaire de Chine]

Source :

RBID : ISTEX:B3D811C479591029C69CAB009AAA5D14692B6539

Abstract

Abstract: As the rapid growth of the scientific documents in digital libraries, the search demands for the documents as well as specific components increase dramatically. Accurately detecting the component boundary is of vital importance to all the further information extraction and applications. However, document component boundary detection (especially the table, figure, and equation) is a challenging problem because there is no standardized formats and layouts across diverse documents. This paper presents an efficient document preprocessing technique to improve the document component boundary detection performance by taking advantage of the nature of document lines. Our method easily simplifies the component boundary detection problem into the sparse line analysis problem with much less noise. We define eight document line label types and apply machine learning techniques as well as the heuristic rule-based method on identifying multiple document components. Combining with different heuristic rules, we extract the multiple components in a batch way by filtering out massive noises as early as possible. Our method focus on an important un-tagged document format – PDF documents. The experimental results prove the effectiveness of the sparse line analysis.

Url:
DOI: 10.1007/978-3-642-20841-6_41


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct:series">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">An Efficient Pre-processing Method to Identify Logical Components from PDF Documents</title>
<author>
<name sortKey="Liu, Ying" sort="Liu, Ying" uniqKey="Liu Y" first="Ying" last="Liu">Ying Liu</name>
</author>
<author>
<name sortKey="Bai, Kun" sort="Bai, Kun" uniqKey="Bai K" first="Kun" last="Bai">Kun Bai</name>
</author>
<author>
<name sortKey="Gao, Liangcai" sort="Gao, Liangcai" uniqKey="Gao L" first="Liangcai" last="Gao">Liangcai Gao</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:B3D811C479591029C69CAB009AAA5D14692B6539</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/978-3-642-20841-6_41</idno>
<idno type="url">https://api.istex.fr/document/B3D811C479591029C69CAB009AAA5D14692B6539/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000969</idno>
<idno type="wicri:Area/Istex/Curation">000958</idno>
<idno type="wicri:Area/Istex/Checkpoint">000052</idno>
<idno type="wicri:doubleKey">0302-9743:2011:Liu Y:an:efficient:pre</idno>
<idno type="wicri:Area/Main/Merge">000401</idno>
<idno type="wicri:Area/Main/Curation">000396</idno>
<idno type="wicri:Area/Main/Exploration">000396</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">An Efficient Pre-processing Method to Identify Logical Components from PDF Documents</title>
<author>
<name sortKey="Liu, Ying" sort="Liu, Ying" uniqKey="Liu Y" first="Ying" last="Liu">Ying Liu</name>
<affiliation>
<wicri:noCountry code="subField"></wicri:noCountry>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
<author>
<name sortKey="Bai, Kun" sort="Bai, Kun" uniqKey="Bai K" first="Kun" last="Bai">Kun Bai</name>
<affiliation>
<wicri:noCountry code="subField"></wicri:noCountry>
</affiliation>
<affiliation>
<wicri:noCountry code="no comma">E-mail: kunbai@us.ibm.com</wicri:noCountry>
</affiliation>
</author>
<author>
<name sortKey="Gao, Liangcai" sort="Gao, Liangcai" uniqKey="Gao L" first="Liangcai" last="Gao">Liangcai Gao</name>
<affiliation>
<wicri:noCountry code="subField"></wicri:noCountry>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">République populaire de Chine</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s">Lecture Notes in Computer Science</title>
<imprint>
<date>2011</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">B3D811C479591029C69CAB009AAA5D14692B6539</idno>
<idno type="DOI">10.1007/978-3-642-20841-6_41</idno>
<idno type="ChapterID">41</idno>
<idno type="ChapterID">Chap41</idno>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: As the rapid growth of the scientific documents in digital libraries, the search demands for the documents as well as specific components increase dramatically. Accurately detecting the component boundary is of vital importance to all the further information extraction and applications. However, document component boundary detection (especially the table, figure, and equation) is a challenging problem because there is no standardized formats and layouts across diverse documents. This paper presents an efficient document preprocessing technique to improve the document component boundary detection performance by taking advantage of the nature of document lines. Our method easily simplifies the component boundary detection problem into the sparse line analysis problem with much less noise. We define eight document line label types and apply machine learning techniques as well as the heuristic rule-based method on identifying multiple document components. Combining with different heuristic rules, we extract the multiple components in a batch way by filtering out massive noises as early as possible. Our method focus on an important un-tagged document format – PDF documents. The experimental results prove the effectiveness of the sparse line analysis.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>République populaire de Chine</li>
<li>États-Unis</li>
</country>
</list>
<tree>
<noCountry>
<name sortKey="Bai, Kun" sort="Bai, Kun" uniqKey="Bai K" first="Kun" last="Bai">Kun Bai</name>
</noCountry>
<country name="États-Unis">
<noRegion>
<name sortKey="Liu, Ying" sort="Liu, Ying" uniqKey="Liu Y" first="Ying" last="Liu">Ying Liu</name>
</noRegion>
</country>
<country name="République populaire de Chine">
<noRegion>
<name sortKey="Gao, Liangcai" sort="Gao, Liangcai" uniqKey="Gao L" first="Liangcai" last="Gao">Liangcai Gao</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000396 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000396 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    OcrV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:B3D811C479591029C69CAB009AAA5D14692B6539
   |texte=   An Efficient Pre-processing Method to Identify Logical Components from PDF Documents
}}

Wicri

This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 16:53:45 2017. Site generation: Mon Mar 11 23:15:16 2024